Binary particle swarm optimization for variables selection optimization in Taguchi’s T-Method
نویسندگان
چکیده
منابع مشابه
Catfish Binary Particle Swarm Optimization for Feature Selection
The feature selection process constitutes a commonly encountered problem of global combinatorial optimization. This process reduces the number of features by removing irrelevant, noisy, and redundant data, thus resulting in acceptable classification accuracy. Feature selection is a preprocessing technique with great importance in the fields of data analysis and information retrieval processing,...
متن کاملBinary particle swarm optimization for operon prediction
An operon is a fundamental unit of transcription and contains specific functional genes for the construction and regulation of networks at the entire genome level. The correct prediction of operons is vital for understanding gene regulations and functions in newly sequenced genomes. As experimental methods for operon detection tend to be nontrivial and time consuming, various methods for operon...
متن کاملAdaptive feature selection using v-shaped binary particle swarm optimization
Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their...
متن کاملportfolio optimization using particle swarm optimization method
the markowitz’s optimization problem is considered as a standard quadratic programming problem that has exact mathematical solutions. considering real world limits and conditions, the portfolio optimization problem is a mixed quadratic and integer programming problem for which efficient algorithms do not exist. therefore, the use of meta-heuristic methods such as neural networks and evolutionar...
متن کاملTest-Case Prioritization Using Binary Particle Swarm Optimization Method
Particle swarm optimization method is based on artificial intelligence technique. It is an optimization method that was developed in 1995 by Eberhart and Kennedy based on the social behaviors of fish schooling or birds flocking. By increasing the overall rate of fault detection, a greater number of errors can be found more rapidly in the code. Particle , fitness function , local best , global b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEMATIKA
سال: 2020
ISSN: 0127-9602,0127-8274
DOI: 10.11113/matematika.v36.n1.1181